منابع مشابه
Intonation of parentheses in spontaneous French sentences
Traditionally, parentheses have been described by phoneticians as speech segments with lower intensity, restrained pitch variation and speech rate faster than the rest of the sentence. This iconic coding may be found in some examples of read (prepared) speech, but spontaneous speech data tend to show that specific prosodic mechanisms do exist to either 1) integrate the syntactic parenthesis int...
متن کاملLinear Formulas in Continuous Logic
We prove that continuous sentences preserved by the ultramean construction (a generalization of the ultraproduct construction) are exactly those sentences which are approximated by linear sentences. Continuous sentences preserved by linear elementary equivalence are exactly those sentences which are approximated in the Riesz space generated by linear sentences. Also, characterizations for linea...
متن کاملCharacter Formulas for the Operad of Two Compatible Brackets and for the Bihamiltonian Operad
We compute dimensions of the components for the operad of two compatible brackets and for the bihamiltonian operad. We also obtain character formulas for the representations of the symmetric groups and the SL2 group in these spaces.
متن کاملA Simple Optimal Representation for Balanced Parentheses
We consider succinct, or highly space-efficient, representations of a (static) string consisting of n pairs of balanced parentheses, that support natural operations such as finding the matching parenthesis for a given parenthesis, or finding the pair of parentheses that most tightly enclose a given pair. This problem was considered by Jacobson, [Proc. 30th FOCS, 549–554, 1989] and Munro and Ram...
متن کاملEfficient EREW PRAM Algorithms for Parentheses-Matching
We present four polylog-time parallel algorithms for matching parentheses on an exclusive-read and exclusive-write (EREW) parallel random-access machine (PRAM) model. These algorithms provide new insights into the parentheses-matching problem. The first algorithm has a time complexity of O( log’ n ) employing O( & ) processors for an input string containing ~1 parentheses. Although this algorit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: BMJ
سال: 2011
ISSN: 0959-8138,1468-5833
DOI: 10.1136/bmj.d570